home *** CD-ROM | disk | FTP | other *** search
- Path: news.ov.com!news
- From: glenn@ov.com (Fletcher.Glenn@ov.com)
- Newsgroups: comp.lang.c
- Subject: Re: Indexing for database...
- Date: 27 Mar 1996 16:41:30 GMT
- Organization: OpenVision
- Message-ID: <4jbr3q$h7e@spanky.pls.ov.com>
- References: <mikenelDot574.8n9@netcom.com>
- Reply-To: glenn@ov.com
- NNTP-Posting-Host: foghorn.pls.ov.com
-
- In article 8n9@netcom.com, mikenel@netcom.com (Michael Nelson) writes:
- >I am in the process of trying to figure out the best way to do indexing for
- >an on-disk database. Most databases and modern file systems seem to use
- >b-trees to do fast lookups of records or directory entries. However, the
- >biggest problem I forsee is the fact that it is difficult to keep the tree
- >balanced. Strange enough, none of the source code I've perused so far seems to
- >bother with keeping the trees balanced.
- >
- >Anyone with more experience (or examples) have any ideas? :-)
- >
- >-- Mike
- >--
- >--
- > movl %cr0, %eax; orl $0x1, %eax; movl %eax, %cr0
- >=============================================================================
- >Michael Nelson mikenel@netcom.com
- >Seattle, Washington Windows NT, OLE, BSD UNIX, Linux Development
-
-
- You really need to research the subject "AVL trees". AVL trees are
- kept in balance as they are updated. Consult any good book on
- computer science.
-
- Fletcher.Glenn@ov.com
-
-
-